Binary linear programming models for robust broadcasting in communication networks
نویسندگان
چکیده
منابع مشابه
Binary linear programming models for robust broadcasting in communication networks
Broadcasting is an information dissemination process in communication networks whereby a message, originated at any node of a network, is transmitted to all other nodes of the network. In c-broadcasting, each node having the message completes up to c transmissions to its neighbors over the communication lines in one time unit. In a kfault tolerant c-broadcast network, the broadcasting process c...
متن کاملRobust Estimation in Linear Regression with Molticollinearity and Sparse Models
One of the factors affecting the statistical analysis of the data is the presence of outliers. The methods which are not affected by the outliers are called robust methods. Robust regression methods are robust estimation methods of regression model parameters in the presence of outliers. Besides outliers, the linear dependency of regressor variables, which is called multicollinearity...
متن کاملBroadcasting in Small-world Communication Networks
The two main characteristics of small-world networks are strong local clustering, and small diameter. These two characteristics are desirable properties in communication networks since typical communication patterns show large amounts of local communication and a small amount of non-local communication that must be completed quickly. In this paper, we study variants of broadcasting that resembl...
متن کاملRange assignment for energy efficient broadcasting in linear radio networks
Given a set S of n radio-stations located on a d-dimensional space, a source node s (∈ S) and an integer h (1 h n − 1), the h-hop broadcast range assignment problem deals with assigning ranges to the members in S so that s can communicate with all other members in S in at most h-hops, and the total power consumption is minimum. The problem is known to be NP-hard for d 2. We propose an O(n2) tim...
متن کاملSolving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks
Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints. In this paper, to solve this problem, we combine a discretization method and a neural network method. By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem. Then, we use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.11.008